Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(0,1,X) |
→ f(g(X,X),X,X) |
| 2: |
|
g(X,Y) |
→ X |
| 3: |
|
g(X,Y) |
→ Y |
|
There are 2 dependency pairs:
|
| 4: |
|
F(0,1,X) |
→ F(g(X,X),X,X) |
| 5: |
|
F(0,1,X) |
→ G(X,X) |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
The usable rules are {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006